From global to local convergence of interior methods for nonlinear optimization
نویسندگان
چکیده
From global to local convergence of interior methods for nonlinear optimization Paul Armand , Joël Benoist & Dominique Orban To cite this article: Paul Armand , Joël Benoist & Dominique Orban (2013) From global to local convergence of interior methods for nonlinear optimization, Optimization Methods and Software, 28:5, 1051-1080, DOI: 10.1080/10556788.2012.668905 To link to this article: http://dx.doi.org/10.1080/10556788.2012.668905
منابع مشابه
A Primal-Dual Exterior Point Method for Nonlinear Optimization
In this paper, primal-dual methods for general nonconvex nonlinear optimization problems are considered. The proposed methods are exterior point type methods that permit primal variables to violate inequality constraints during the iterations. The methods are based on the exact penalty type transformation of inequality constraints and use a smooth approximation of the problem to form primal-dua...
متن کاملA globally convergent primal-dual interior-point three-dimensional filter method for nonlinear semidefinite programming
This paper proposes a primal-dual interior-point filter method for nonlinear semidefinite programming, which is the first multidimensional (three-dimensional) filter methods for interior-point methods, and of course for constrained optimization. A freshly new definition of filter entries is proposed, which is greatly different from those in all the current filter methods. A mixed norm is used t...
متن کاملLine Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
Line search methods are proposed for nonlinear programming using Fletcher and Leyffer’s filter method, which replaces the traditional merit function. Their global convergence properties are analyzed. The presented framework is applied to active set SQP and barrier interior point algorithms. Under mild assumptions it is shown that every limit point of the sequence of iterates generated by the al...
متن کاملInterior-Point Gradient Methods with Diagonal-Scalings for Simple-Bound Constrained Optimization
In this paper, we study diagonally scaled gradient methods for simple-bound constrained optimization in a framework almost identical to that for unconstrained optimization, except that iterates are kept within the interior of the feasible region. We establish a satisfactory global convergence theory for such interior-point gradient methods applied to Lipschitz continuously differentiable functi...
متن کاملGlobal and Local Convergence of Line Search Filter Methods for Nonlinear Programming
Line search methods for nonlinear programming using Fletcher and Leyffer’s filter method, which replaces the traditional merit function, are proposed and their global and local convergence properties are analyzed. Previous theoretical work on filter methods has considered trust region algorithms and only the question of global convergence. The presented framework is applied to barrier interior ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Optimization Methods and Software
دوره 28 شماره
صفحات -
تاریخ انتشار 2013